翻訳と辞書 Words near each other ・ D. pentaphylla ・ D. Perera ・ D. Peter Forbes ・ D. Phil Woodruff ・ D. plicata ・ D. polymorpha ・ D. Price Marshall Jr. ・ D. purpurea ・ D. Purushothaman ・ D. Putnam Brinley ・ D. Quentin Miller ・ D. R. Bendre ・ D. R. Bhandarkar ・ D. R. Brown ・ D. R. Brown (American football) ・ D. R. Fulkerson ・ D. R. Horton ・ D. R. Horton Tower ・ D. R. Kaprekar ・ D. R. Karthikeyan ・ D. R. MacDonald ・ D. R. Mehta ・ D. R. Moon Memorial Library ・ D. R. Nagaraj ・ D. R. Nanayakkara ・ D. R. Rajaram Naidu ・ D. R. Seenivasagam ・ D. R. Settinayake ・ D. R. Shackleton Bailey ・ D. R. Thorpe Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク D. R. Fulkerson ： ウィキペディア英語版 D. R. Fulkerson Delbert Ray Fulkerson (August 14, 1924 – January 10, 1976) was an American mathematician who co-developed the FordFulkerson algorithm, one of the most well-known algorithms to solve the maximum flow problem in networks. ==Early life and education== D. R. Fulkerson was born in Tamms, Illinois, the third of six children of Elbert and Emma Fulkerson. Fulkerson became an undergraduate at Southern Illinois University. His academic career was interrupted by military service during World War II. Having returned to complete his degree after the war, he went on to do a Ph.D. in mathematics at the University of Wisconsin–Madison under the supervision of Cyrus MacDuffee, who was a student of L. E. Dickson. Fulkerson received his Ph.D. in 1951.〔(【引用サイトリンク】title=Delbert Ray Fulkerson )〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「D. R. Fulkerson」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.